Graphs Associated with Codes of Covering Radius 1 and Minimum Distance 2
نویسنده
چکیده
The search for codes of covering radius 1 led Österg̊ard, Quistorff and Wassermann to the OQW method of associating a unique graph to each code [9]. We present results on the structure and existence of OQW-associated graphs. These are used to find an upper bound on the size of a ball of radius 1 around a code of length 3 and minimum distance 2. OQW-associated graphs and non-extendable partial Latin squares are used to catalogue codes of length 3 over 4 symbols with covering radius 1 and minimum distance 2.
منابع مشابه
A family of binary completely transitive codes and distance-transitive graphs
In this paper we construct new family of binary linear completely transitive (and, therefore, completely regular) codes. The covering radius of these codes is growing with the length of the code. In particular, for any integer ρ ≥ 2, there exist two codes in the constructed class of codes with d = 3, covering radius ρ and length ( 4 ρ 2 ) and ( 4 ρ+2 2 ) , respectively. These new completely tra...
متن کاملOn Codes with Given Minimum Distance and Covering Radius
Codes with minimum distance at least d and covering radius at most d− 1 are considered. The minimal cardinality of such codes is investigated. Herewith, their connection to covering problems is applied and a new construction theorem is given. Additionally, a new lower bound for the covering problem is proved. A necessary condition on an existence problem is presented by using a multiple coverin...
متن کاملNormal and abnormal codes
It is proved that codes of length n, covering radius Z?, and minimum Hamming distance 2R-1 are normal if R does not divide n. Constructions for abnormal codes with covering radius R and minimum Hamming distance at least R-l are given.
متن کاملOn linear completely regular codes with covering radius rho=1. Construction and classification
Completely regular codes with covering radius ρ = 1 must have minimum distance d ≤ 3. For d = 3, such codes are perfect and their parameters are well known. In this paper, the cases d = 1 and d = 2 are studied and completely characterized when the codes are linear. Moreover, it is proven that all these codes are completely transitive.
متن کاملOn Upper Bounds for Minimum Distances and Covering Radius of Non-binary Codes
We consider upper bounds on two fundamental parameters of a code; minimum distance and covering radius. New upper bounds on the covering radius of non-binary linear codes are derived by generalizing a method due to S. Litsyn and A. Tiett avv ainen 10] and combining it with a new upper bound on the asymptotic information rate of non-binary codes. The new upper bound on the information rate is an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. J. Comb.
دوره 15 شماره
صفحات -
تاریخ انتشار 2008